Computational mathematics - PDFSEARCH.IO - Document Search Engine

Computational mathematics
Results: 4662

#	Item
151	COMP-201: Discrete Computational Structures (Fall 2008 Syllabus) Instructor: Y¨ucel Yemez, Rm: Eng-139, Email: , Phone: , Office hours: Tuesday/Thursday 14:30-15:30. Teaching Assistants: Add to Reading List Source URL: atakangunal.com Language: English - Date: 2014-10-22 13:26:07 Logic Mathematical logic Mathematics Boolean algebra Classical logic Propositional calculus Discrete mathematics Algorithm Academic dishonesty
152	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: comopt.ifi.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
153	UNIFORM GRIDS: A TECHNIQUE FOR INTERSECTION DETECTION ON SERIAL AND PARALLEL MACHINES Wm. Randolph Franklin Chandrasekhar Narayanaswaml Mohan Kankanhalll Add to Reading List Source URL: mapcontext.com Language: English Parallel computing Computer science Computational complexity theory Computational geometry Randomized algorithm Sweep line algorithm Polyhedron Mathematics Spanning tree Hidden line removal Arrangement of lines
154	OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2007-10-09 08:45:20 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Matching Flow network 3-dimensional matching Vertex cover
155	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2009-01-01 08:42:54 Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony
156	2nd Student Workshop on Ecology and Optics of Coastal Zones, 2016 Kaliningrad, Russia, 19-23 JulyARTIFICIAL NEURAL NETWORKS AND THEIR APPLICATION Add to Reading List Source URL: www.earsel.org Language: English - Date: 2016-07-18 12:44:41 Artificial neural network Computational neuroscience Mathematical psychology Spectroscopy Inverse problem Applied mathematics Academia
157	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Language: English - Date: 2012-07-04 18:28:36 Mathematical optimization Mathematics Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method
158	Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§ Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-05-11 07:37:06 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Scheduling Polynomial-time approximation scheme Makespan Time complexity Partition Randomized algorithm Algorithm Integral
159	Scalable Flow-Based Community Detection for Large-Scale Network Analysis Seung-Hee Bae∗ , Daniel Halperin∗ , Jevin West† , Martin Rosvall‡ and Bill Howe∗ ∗ Department of Computer Science and Engineering, Uni Add to Reading List Source URL: www.jevinwest.org Language: English - Date: 2015-11-11 00:05:03 Mathematics Computational complexity theory NP-complete problems Algorithm Mathematical logic Theoretical computer science Graph partition Community structure Connectivity
160	Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡ Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2007-05-07 14:18:08 Cryptography Theoretical computer science Pseudorandomness Randomness Applied mathematics Information theory Computational complexity theory Random number generation Extractor Entropy Disperser Pseudorandom generator

UPDATE